System and method for quantitative competition and recording medium having recorded thereon program for implementing the method

ABSTRACT

A bid-opening device  20  receives from each bidding device  10   m  a bidding price index γ m =g(h k (IV m )) (where IV m  is an initial value, h k  indicates k-times processing with a one-way function h and g is a one-way function) and its identifier ID m . The received information is stored on a common bulletin board  25 . D m =h k (IV m ) (where D m =g(D m ) is generated with k set as the upper limit value K of the bidding price. The bulletin board  25  is checked for γ m  which matches this D m . If no match is found, m is incremented by one, and the check for γ m −D m  matching is made for each of m bidding devices. Upon completion of the matching for all the bidding devices, k is decremented by one, and a check is made for γ m  which matches D m =g(h k (IV m )), and the index k for which they match is determined as the highest price bid. The bid-opening device  20  outputs that k and the identifier ID m  of γ m .

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a Divisional of application Ser. No. 09/619,699, filed on Jul. 19, 2000 (now allowed), and for which priority is claimed under 35 U.S.C. §120; and this application claims priority of Application No. 205004/99 filed in Japan on Jul. 19, 1999 under 35 U.S.C. §119; Application No. 247060 filed in Japan on Sep. 1, 1999 under 35 U.S.C. §119 Application No. 2000-16020 filed in Japan on Jan. 25, 2000 under 35 U.S.C. §119; and Application No. 2000-47323 filed in Japan on Feb. 24, 2000 under 35 U.S.C. §119; the entire contents of all are hereby incorporated by reference

BACKGROUND OF THE INVENTION

The present invention relates to a quantitative competition system and method which compare aimed or intended values of participants and publish the highest or lowest value but hide the other values, and a recording medium on which there is recorded a program for implementing the method. More particularly, the invention pertains to a system and method for quantitative comparison of secret values, for example, in electronic lottery, electronic voting, or electronic sealed-bid auction under circumstances where many participants are allowed to access the server online across the Internet.

FIG. 1 is depicts in block form the configuration of a conventional electronic competitive bidding or sealed-bid auction system. A notice of auction is input to bidding devices 10 ₁ to 10 _(M), which send their identifiers ID₁ to ID_(M) and bidding prices PR₁ to PR_(M) to a bid-opening device 20. In this transfer of each data, if it is desirable to keep the data secret, the bidding price is sent in compressed form, and if it is necessary to identify the data, it is sent together with a digital signature of the bidder. The bid-opening device 20 detects the highest (or lowest) one of the bid values received from the bidding devices 10 ₁ to 10 _(M), and outputs the winning bid and the identifier corresponding thereto. This scheme is disclosed, for example, in Japanese Patent Application Laid-Open Gazette No. 118876/90 entitled “Electronic Bidding System.” On the other hand, schemes which publish only the winning bid but hide other information involved are disclosed, for example, in Kazuo SAKO, “Auction Protocol Which Hides Bids of Losers,” The Symposium on Cryptography and Information Security, SCIS'99, and in Shingo MIYAZAKI and Kouichi SAKURAI, “A Bulletin-Board Base Digital Auction Scheme with Bidding Down Strategy,” The Symposium on Cryptography and Information Security SCIS'99.

The sealed-bid auction scheme to which the present invention is applied satisfies the requirements mentioned below.

*Only bidding prices are used to determine the winning bid; that is, the successful bidding device is not determined using other information.

The bid-opening device and a provisional identifier registration device neither cheat nor malfunction.

SUMMARY OF THE INVENTION

It is therefore an object of the present invention to provide a quantitative competition system and method which ensure the fairness of a sealed-bid auction, the validity of a successful bid value, the undeniability of bidders, the anonymity of the bidders and the freedom from double bidding.

The fairness of an auction means that it is possible to prevent bidders from obtaining information on other bidding devices prior to bidding in an attempt to make bids with unfair advantage.

The validity of a successful bid value means that it is possible to prevent an unfair determination of the winning bid.

The undeniability of bidders means that it is possible to prevent them from denying their bid values at the bid-opening time.

The anonymity of bidders means that it is possible to prevent leakage of identification information of every bidding device.

According to the present invention, each bidding device transforms its bidding price to bidding price information through utilization of a one-way function, and the bid-opening device uses the bidding price information to determine the successful bid without revealing the prices bid by unsuccessful bidders.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram showing the general configuration of an electronic competitive bidding system;

FIG. 2 is a flowchart showing the general procedure of an electronic sealed-bid auction;

FIG. 3 is a block diagram depicting a bidding device which uses one-way functions to generate a bid index;

FIG. 4 is a block diagram depicting a concrete example of a bidding price transformer using one-way function processors;

FIG. 5 is a flowchart showing the procedure for generating the bid index through the use of one-way functions;

FIG. 6 is a block diagram illustrating the functional configuration of a bid-opening device 20 in a first embodiment of the present invention which is designed to determine the highest price bid as the winning bid;

FIG. 7 is a flowchart showing the operation of the bid-opening device 20 depicted in FIG. 6;

FIG. 8 is a block diagram illustrating the functional configuration of a bid-opening device in a second embodiment of the present invention;

FIG. 9 is a flowchart showing the operation of the bid-opening device depicted in FIG. 8;

FIG. 10 is a block diagram illustrating the functional configuration of a bid-opening device in a third embodiment of the present invention which is designed to determine the highest price bid as the winning bid;

FIG. 1 is a flowchart showing the bid-opening procedure of the bid-opening device depicted in FIG. 10;

FIG. 12 is a block diagram illustrating the functional configuration of a bidding device in a fourth embodiment of the present invention;

FIG. 13 is a block diagram illustrating the functional configuration of a bid-opening device in the fourth embodiment;

FIG. 14 is a flowchart showing the bid-opening procedure of the bid-opening device depicted in FIG. 13;

FIG. 15 is a block diagram illustrating the functional configuration of a bidding device in a fifth embodiment of the present invention;

FIG. 16 is a flowchart showing the bidding procedure of the bidding device depicted in FIG. 15;

FIG. 17 is a block diagram illustrating the functional configuration of a bid-opening device in a fifth embodiment of the present invention;

FIG. 18 is a flowchart showing the bid-opening procedure of the bid-opening device depicted in FIG. 17;

FIG. 19 is a flowchart showing the bid-opening procedure in a modified form of the fifth embodiment;

FIG. 20 is a block diagram illustrating the functional configuration of a bidding device in a sixth embodiment of the present invention;

FIG. 21 is a flowchart showing the bidding procedure of the bidding device depicted in FIG. 20;

FIG. 22 is a block diagram illustrating the functional configuration of a bid-opening device in the sixth embodiment;

FIG. 23 is a flowchart showing the bid-opening procedure of the bid-opening device depicted in FIG. 22;

FIG. 24 is a flowchart showing a modified form of the bid-opening procedure depicted in FIG. 23;

FIG. 25 is a block diagram illustrating the functional configuration of a bidding device in a seventh embodiment of the present invention;

FIG. 26 is a flowchart showing the bidding procedure of the bidding device depicted in FIG. 25;

FIG. 27 is a block diagram illustrating the functional configuration of a bid-opening device in the seventh embodiment;

FIG. 28 is a flowchart showing the bid-opening procedure of the bid-opening device depicted in FIG. 27;

FIG. 29 is a flowchart showing a modified form of the bid-opening procedure depicted in FIG. 28;

FIG. 30 is a block diagram illustrating the functional configuration of a bidding device in an eighth embodiment of the present invention;

FIG. 31 is a block diagram illustrating the functional configuration of a bid-opening device in the eighth embodiment;

FIG. 32 is a flowchart showing the bid-opening procedure of the bid-opening device depicted in FIG. 31;

FIG. 33 is a block diagram illustrating an electronic sealed-bit auction system which utilizes a provisional identifier; and

FIG. 34 is a flowchart showing the bidding procedure in the system depicted in FIG. 33.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS First Embodiment

The electronic competitive sealed-bid auction system according to this embodiment comprises, as is the case with FIG. 1, M bidding devices 10 ₁ to 10 _(M) and a bid-opening device 21, which are accessible to each other. This system operates as depicted in the flowchart of FIG. 2.

Step S1: Input a notice of auction to each of the bidding devices 10 ₁ to 10 _(M). The notice of auction describes bidding conditions such as the name of an object for auction, the highest and/or lowest price bid, the term for bidding and qualifications for bidding, and a method of access to the bid-opening device. The bidding conditions differ with objects for auction.

Step S2: In response to the notice of auction which describes the details of the auction, each bidding device 10 _(m) (where m=1, 2, . . . , M) generates a bidding price, and sends to the bid-opening device 20 the bidding price PR_(m) and an identifier ID_(m) by which the bidding device 10 _(m) can be identified.

Step S3: Having received from the respective bidding device 10 ₁ to 10 _(M) their bidding prices PR₁ to PR_(M) and identifiers ID₁ to ID_(M), the bid-opening device 20 computes the highest (or lowest) one of the bidding prices and determines it to be the winning bid.

Step S4: The bid-opening device 20 outputs the winning bid and the identifier of the bidding device having submitted it.

The above procedure is the same as in the prior art. Since the communication channel between each bidding device 10 _(m) and the bid-opening device 20 is not an anonymous channel, in particular, such a procedure as shown in FIG. 2 allows each bidding device 10 _(m) to learn the bidding prices of the other bidding devices by wiretapping. To avoid this, according to the present invention, each bidding device 10 m uses one-way functions to transform the bidding price to bidding price information, which is sent to the bid-opening device 20.

Referring to FIG. 3, the bidding device 10 m comprises an input part 11, an information storage part 12, a control part 13 and a bidding price transformer 14. The control part 13 follows a control procedure stored in the information storage part 12 to control operations of the respective parts. The notice of auction, which describes the bidding conditions, is provided in advance via a channel to the bidding device 10 _(m) from the bid-opening device 20 or some other device. In the information storage part 12 there are also stored the identifier ID_(m) of this bidding device 10 m and an initial value IV_(m) which is used for bidding. At the time of bidding, the bidding price PR_(m) provided to the input part 11 is fed via the control part 13 into the bidding price transformer 14. The bidding price transformer 14 uses one-way functions to transform the bidding price PR_(m) to bidding price information γ_(m) in integral form. The bidding price information γ_(m) and the identifier ID_(m) are sent from a transceiver (not shown) to the bid-opening device 20 via a communication channel. Based on the bidding price information from every bidding device 10 _(m), the bid-opening device 20 decides the winning bid.

In this embodiment, the bidding price transformer 14 is supplied with the initial value IV_(m) read out of the information storage part 12 by the control part 13 and the bidding price PR_(m), and processes the initial value IV_(m) by a one-way function by the number of times corresponding to the bidding price PR_(m) as described below. A one-way function is such a function that, given a variable x, y(=h(x)) can easily be computed from x, but when given y, very high computational complexity is needed to compute x such that y=h(x). An output value, obtained by processing the initial value IV_(m) with the one-way function h by k times like h( . . . h(h(h(IV_(m)))) . . . ), will hereinafter be represented by h^(k)(IV_(m)).

A concrete example of the bidding price transformer 14 is depicted in FIG. 4 and its procedure in FIG. 5. The bidding price transformer 14 comprises a data storage part 14S, conversion table memory 15, a one-way function h processor 16 and a one-way function g processor 17. Incidentally, the examples of the bidding device 10 _(m) depicted in FIGS. 3 and 4 will also be referred to in describing second and third embodiments of the invention later on, in which case the broken-lined data storage part 14S is provided to store the result D_(m) of each computation by the one-way function h and the final result C_(m) of computation. A conversion table, which is stored in the conversion table memory 15, is contained as one bidding condition in the notice of auction, for instance. Each bidding device 10 m reads out the conversion table from a bulletin board 25 of the bid-opening device 20 which will be described later on with reference to FIG. 6. The conversion table is a table on which there are shown appropriately-separated K bidding prices from the lowest to the highest bidding price and a series of corresponding indexes k=1, 2, . . . , K. Each bidding device 10 _(m) selects a desired bidding price from the conversion table and uses the corresponding index k as a bidding price index k_(m). In the FIG. 4 example the bidding prices corresponding to the indexes k=1, 2, . . . , K are arranged to monotonously increase, but by arranging them to monotonously decrease, the lowest bidding price can be made a winning bid.

The one-function h processor is supplied with the initial value IV_(m) and the price index k_(m) corresponding to the bidding price PR_(m) read out of the conversion table memory 15, and repeatedly processes the initial value IV_(m) with the one-way function h by the number of times corresponding to the price index k_(m). As a result, h^(km)(IV_(m)) is obtained. The one-way function g processor 17 further processes the output value h^(km)(IV_(m)) with a one-way function g to compute γ_(m)=g(h^(km)(IV_(m))), and output it as bidding price information.

Step S1: Input the bidding price PR_(m) and the initial value IV_(m).

Step S2: Read out of the conversion table memory 15 the price index k_(m) corresponding to the bidding price PR_(m).

Step S3: In the one-way function h processor 16, set the initial value of a variable t at 0 and the initial value IV_(m) as γ_(m), and repeat steps S4 and S5.

Step S4: Determine if t is smaller than k_(m).

Step S5: If t<k_(m), update γ_(m) with the value of h(γ_(m)) at that time, then increment t by one, and return to step S4.

Step S6: When t becomes no longer smaller than k_(m), γ_(m)=h^(km)(IV_(m)), which is processed by the one-way function g processor 17 such that γ_(m)←g(γ_(m)).

Step S7: Output, as the bidding price information, γ_(m) obtained in step S6.

BID-Opening Device (Successful Bid: Highest Bidding Price Bid)

FIG. 6 is a block diagram of the bid-opening device 20, which comprises a control unit 21, and a one-way function h processor 22, a one-way function g processor 23, an adder/subtractor 24, a bulletin board 25, a program storage part 27S, an information storage part 35 and an update data storage part 36 which are all connected to the control unit 21. In the program storage part 27S there is stored a bid-opening procedure as a program, and the control unit 21 follows the program to control operations of the respective parts. The one-way function h processor 22 and the one-way function g processor 23 are series-connected. The parts except the bulletin board 25 constitute a winning bid selector 27. The number of bidding devices are M, and the initial value IV_(m) unique to each bidding device 10 _(m) (where m=1, 2, . . . , M) is prestored by some means in the information storage part 35. In the bulletin board 25 there are also recorded other bidding conditions including a conversion table 25A; furthermore, verification information and the results of auction to be published are written in the bulletin board 25. The pieces of information are accessible from any external devices as well as from the bidding devices. In this case, however, assume that only the bid-opening device 20 is allowed to write in the bulletin board 25 (This applies to other embodiments).

In FIG. 7 there is depicted the procedure of operation of the bid-opening device 20. In this example the bidding price corresponding to the largest price index k_(m) is made a successful bid as follows. The index value is decremented one by one from the largest index K corresponding to the upper limit of the bidding price specified in the conversion table; a check is made for the presence of the bidding price information γ_(m) (where m=1, 2, . . . , M) corresponding to each index k is present; and when the bidding price information γ_(m) corresponding to the index k is detected for the first time, the detected bidding price information γ_(m) is determined to be the winning bid, and m (the bidding device number) at that time is computed, with which the bid-opening procedure ends.

Step S0: The bidding device 10 _(m) inputs its bidding price information γ_(m) and identifier ID_(m) (where m=1, 2, . . . , M) to the bid-opening device 20.

Step S1: The control unit 21 records the bidding price information γ_(m) and the identifier ID_(m) in the bulletin board 25 accessible from arbitrary external devices (the bidding devices 10 ₁ to 10 _(M) and other devices which are not bidders).

Step S2: To precalculate D_(m) ⁽¹⁾, D_(m) ⁽²⁾, . . . , D_(m) ^((K)) such that D_(m) ^((k))=h(D_(m) ^((k−1))) in the subsequent steps S3 to S6, the control unit 21 sets the bidding price index k←1, then reads out ID_(m) from the information storage part 35, and substitutes it for D_(m) ⁽⁰⁾.

Step S3: The control unit 21 determines whether k>K.

Step S4: If not k>K, process D_(m) ^((k−1)) by the one-way function h processor 22 to obtain D_(m) ^((k)).

Step S5: Store D_(m) ^((k)) in the update data storage part 36.

Step S6: Increment k by the adder/subtractor 24 such that k←k+1.

Step S7: If k>K in step S3, it means that D_(m) ⁽¹⁾=h(D_(m) ⁽⁰⁾)=h(IV_(m)), D_(m) ⁽²⁾=h(D_(m) ⁽¹⁾)=h²(IV_(m)) . . . , D_(m) ^((K))=h^(K)(IV_(m)) have all been obtained, then set k←K.

Step S8: Read out D_(m) ^((K))=h^(K)(IV_(m)) from the update data storage part 36 and process it by the one-way function g processor 23 to obtain D_(m) ^((k))←g(D_(m) ^((k))).

Step S9: For m=1, 2, . . . , M, the control unit 21 makes a check to see if there exists on the bulletin board 25 the bidding price information γ_(m) of the same value as D_(m) ^((k)).

Step S10: If there does not exist on the bulletin board 25 the information γ_(m) of the same value as D_(m) ^((k)), the control unit 21 inputs k to the adder/subtractor 24 to decrement k by one (i.e., k←k−1), then returns to step S8, and in steps S8 and S9 it makes a check to see if there exists on the bulletin board 25 the bidding price information γ_(m) of the same value as D_(m) ^((k))=g(h^(k)(IV_(m))) for m=1, 2, . . . , M.

Step S11: If the information γ_(m) of the same value as D_(m) ^((k)) is found on the bulletin board 25 in step S9, then the control unit 21 regards it as the successful price bid and outputs the index k at this time and the bidding device identifier ID_(m) corresponding to the information γ_(m), with which the procedure ends.

As described above, a check is made first for a bidding device 10 _(m) having input the bidding price information γ_(m) equal to D_(m) ^((k))(=g(h^(k)(IV_(m)))) when the price index k is at the upper limit value K; if no such a bidding device is found, then a check is made for a bidding device 10 _(m) having input the bidding price information γ_(m) equal to D_(m) ^((k)) when the index k is decremented by one, i.e. k←k−1; and if no such a bidding device is found, then a check is made for a bidding device 10 _(m) having input the bidding price information γ_(m) equal to D_(m) ^((k)) when the index is further decremented by one, i.e. k←k−1. By making a check, for each decremented value of k, for the bidding device 10 _(m) having input the bidding price information γ_(m) equal to D_(m) ^((k))(=g(h^(k)(IV_(m)))), it is possible to find out the price information γ_(m) corresponding to the largest index k, that is, the highest bidding price PR_(m).

Furthermore, each bidding device 10 m sends h^(km+1)(IV_(m)) to the bid-opening device 20 in advance, and the bid-opening device 20 publishes it on the bulletin board 25 and, after determining the successful bidding price, publishes on the bulletin board 25 the highest bidding price index k and the identifier ID_(m) of the successful bidding device and the verification information h^(k)(IV_(m)); in this instance, since k ought to equal k_(m), it is possible for an arbitrary device, except the bid-opening device 20, to verify the validity or fairness of the bid-opening process by processing he published verification information h^(k)(IV_(m)) with the one-way function h to obtain h^(k+1)(IV_(m)) and making sure that it matches h^(km+1)(IV_(m)) published prior to the determination of the winning bid. Alternatively, the verification of the bid-opening procedure can be made by publishing the verification information h^(k)(IV_(m)) of each bidding device on the bulletin board 25 in advance and making a check to see if the value, obtained by processing h^(km)(IV_(m)) published on the bulletin board 25 with the one-way function h by (K−k_(m)) times, matches h^(k)(IV_(m)).

In the case where the lowest price bid is the winning bid, the bidding prices corresponding to the price indexes k on the conversion table are arranged so that they monotonously increase from the lowest value, as referred to previously.

In the embodiment described above, all the bidding device 10 ₁ to 10 _(M) send h^(km+)(IV_(m)) to the bid-opening device 20 in advance for verification of the results of bid-opening, and the bid-opening device 20 writes it on the bulletin board. It is easy to compute h^(k+1)(z) from h^(k)(z) in the computation h^(k+1)(z)=h(h^(k)(z)) using the one-way function, but the computation of h^(k)(z) from h^(k+1)(z) involves too enormous computational complexity to deal with practically. Accordingly, even if the bidding device publishes in advance h^(kv)(IV_(m)) computed using an index k_(v) larger than the bidding price index k_(m), there is no possibility of other devices learning the index k_(m) unless the bid-opening is performed in terms of the index k_(m).

The value k_(v) of the verification information h^(kv)(IV_(m)) may be a value k_(v)=k_(m)+A which is obtained by adding the bidding price index k_(m) with a predetermined integer A equal to or greater than 1, or a value k_(v)=K+A which is obtained by adding the maximum index K with the integer A. In the former case, h^(km)(IV_(m)) is processed A times with the one-way function h and the resulting value is checked for matching the published information h^(kv)(IV_(m)). In the latter case, h^(km)(IV_(m)) is processed K+A−k_(m) times with the one-way function h and the resulting value is checked for matching the published information h^(kv)(IV_(m)).

In the embodiment described above, the bidding devices 10 ₁ to 10 _(M) each convert the bidding price PR to the index k by the conversion table and the initial value IV_(m) is processed with the one-way function by the number of times corresponding to the index k, but the use of the conversion table is not essential to the present invention. For example, the index k itself may be the bidding price, in which case neither of the bidding devices the bid-opening device requires the conversion table and any one of a series of value k which monotonously increase one by one within a predetermined range defined by the upper and lower limits given as one of the conditions for auction is chosen as the bidding price PR.

Second Embodiment

In the first embodiment the bid-opening device 20 must be informed of the initial value IV_(m) of each bidding device 10 _(m). In this embodiment, however, the bid-opening device 20 requires the bidding device 10 _(m) to send D_(m)=h^(k)(IV_(m)) corresponding to the price index k, and hence it does not need the initial value IV_(m). Since the price index k varies one by one such that k=1, 2, . . . , K, this embodiment utilizes the fact that h^(k+1)(IV_(m))=h(h^(k)(IV_(m))) holds; the bid-opening device 20 verifies the response h^(k)(IV_(m)) from the bidding device in reply to an inquiry k, then computes g(h^(k)(IV_(m))), and checks it for matching the bidding price information γ_(m) (where m=1, 2, . . . , M).

A description will be given of the case where the highest bid is the successful bid.

The bidding device 10 _(m) has a configuration in which the data storage part 14S indicated by the broken line in FIG. 4 is added to the bidding price transformer 14. The bidding device 10 _(m) precomputes D_(m)=h^(k)(IV_(m)) by the one-way function h processor 16 for each value k=1, 2, . . . , K+1, and stores it in the data storage part 14S. When inquired about k from the bid-opening device 20, the bidding device 10 _(m) reads out of the data storage part 14S the data h^(k)(IV_(m)) corresponding to k and sends it as the response D_(m)=h^(k)(IV_(m)) to the bid-opening device 20. Furthermore, the bidding device 10 _(m) sends to the bid-opening device 20 the data h^(K+1)(IV_(m)) as the verification information C_(m), together with the bidding price information γ_(m). As depicted in FIG. 8, the bid-opening device 20 comprises a control unit 21, a one-way function h processor 22, a one-way function g processor 23, a subtractor 24, a program storage part 27S and a bulletin board 25 accessible from other devices. On the bulletin board 25 there are published a conversion table 25A along with conditions for auction.

The bid-opening device 20 operates as depicted in FIG. 9.

The bidding devices 10 _(m) each send h^(K+1)(IV_(m)) as the verification information C_(m) in advance to the bid-opening device 20 together with the bidding price information γ_(m) and the identifier ID_(m). The bid-opening device 20 publishes these pieces of data on the bulletin board 25. Let it be assumed here that M bids are submitted, and hence m=1, 2, . . . , M.

Step S1: Write and hence publish on the bulletin board 25 the plural pieces of data sent to the bid-opening device 20, that is, the bidding price information γ_(m)(=g(h^(km)(IV_(m)))), the verification information C_(m) and the identifier ID_(m).

Step S2: Set the initial value of the index k at the upper limit value K by control unit 21.

Step S3: Request each bidding device 10 _(m) to present D_(m)=h^(k)(IV_(m)). The bidding device 10 _(m) reads out of the data storage part 14S the data h^(k)(IV_(m)), and sends it to the bid-opening device 20 as D_(m).

Step S4: Record and hence publish on the bulletin board 25 the data D_(m) sent from every bidding device 10 _(m).

Step S5: Generates h(D_(m)) for each D_(m) by the one-way function h processor 22.

Step S6: Make a check to see if all the pieces of data h(D_(m)) match all the pieces of verification information C_(m) on the bulletin board 25; if no mismatch is found, then determine that they are all correct or valid, and continue the subsequent steps. If a mismatch is found, then sends an error message to every bidding device 10 _(m) and finish the bid-opening operation.

Step S7: When no mismatch is found in step S6, generate data g(D_(m)) by the one-way function g processor 23.

Step S8: Make a check to see if each data g(D_(m)) matches the bidding price information γ_(m); if no match is found, update C_(m) on the bulletin board 25 with D_(m)(C_(m)←D_(m)).

Step S10: Set k←k−1 by the subtractor 24 and return to step S3.

Step S11: If even one of the pieces of information γ_(m) is found to match with g(D_(m)) in step S8, decide k at that time as the price index corresponding to the winning bid, and output the index k and the identifier ID_(m) of the bidding device 10 _(m) having offered the successful bid.

In this instance, the values of losing bids other than the winning one are kept secret from even the bid-opening device 20.

In this embodiment, too, the lowest price bid can be chosen as the winning bid simply by arranging the bidding prices in such a manner as to monotonously decrease relative to a monotonously increasing index k on the conversion table, or by arranging the bidding prices in such a manner as to monotonously increase relative to a monotonously decreasing index k.

Third Embodiment

In the second embodiment described above, as depicted in FIG. 9, the bid-opening device 20 requires all the bidding devices to present h^(k)(IV_(m)) and receive it for each value of the price index k until the first detection of a match between g(D_(m)) and γ_(m) in step S3. Accordingly, the sealed-bit auction scheme according to the second embodiment has the defect of a large communication cost. This embodiment requires the bid-opening device 20 to be informed of nothing but the initial value IV_(m), publishes only the winning bid, that is, hides the losing bids, and reduces the communication cost.

The bidding device 10 _(m) is identical in construction as in the second embodiment, and in the constructions of FIGS. 3 and 4 the data storage part 14S is provided in which there are prestored D_(m) ⁽¹⁾, . . . , D_(m) ^((K)) and C_(m)=D_(m) ^((k+1)). The bid-opening device 20, shown in FIG. 10, is basically identical in construction with the bid-opening device of FIG. 8, and no description will be repeated, but as will be described below with reference to FIG. 11, the operation of the bid-opening device in this embodiment differs from the operation depicted in FIG. 9.

Step S0: The bidding devices 10 ₁ to 10 _(M) each send in advance the verification information C_(m) (=h^(k+1)(IV_(m))) to the bid-opening device 20 together with the bidding price information γ_(m) (=g(h^(km)(IV_(m))) and the identifiers ID_(m).

Step S1: The bid-opening device 20 first publishes the plural pieces of bidding price information γ_(m) and verification information C_(m) and the identifiers ID_(m) on the bulletin board 25.

Step S2: Set the count value k of a counter 24 at the upper limit value K.

Step S3: Inquire of all the bidding devices 10 _(m) (where m=1, 2, . . . , M) about whether they have bid the price k.

Step S4: Decide whether there is bidding device having bid with the price index k.

Step S5: If no bidding device have bid the price, decrement k by the subtractor 24 to k←k−1 and return to step S3.

Step S6: When it is found that any one of the bidding devices 10 _(m) has bid with the price index k, request all the bidding devices 10 m to present h^(k)(IV_(m)). Each bidding device 10 _(m) reads out of the data storage part 14S the data D_(m)=h^(k)(IV_(m)) precalculated corresponding to k as depicted in FIG. 4, and sends the read-out data D_(m) to the bid-opening device 20.

Step S7: Publishes all the responses D_(m) from the bidding devices 10 _(m) on the bulletin board 25.

Step S8: For all the responses D_(m), generate h^(K−k+1)(D_(m)) by the one-way function h processor 22.

Step S9: Check whether each data h^(K−k+)1(D_(m)) matches the corresponding verification information C_(m) on the bulletin board 25. If no mismatch is found, decide that the responses Dm are all correct, and proceed to the subsequent steps. If a mismatch is found, send an error message to each bidding device 10 _(m) and finish this bid-opening session for the price index k.

Step S10: When no mismatch is found in step S9, generate g(D_(j)) by the one-way function g processor 23 for the response D_(j) (where 1≦j≦M) from the bidding device 10 _(j) which has identified itself as having bid with the price k.

Step S11: Check whether g(D_(j)) matches the bidding price information γ_(j) of the bidding device 10 j on the bulletin board 25. If they match, decide that the bidding device 10 _(j) has bid the price k. If they do not match, send an error message to all the bidding devices and discontinue the session.

As described above, in this embodiment, when no bidding device identifies itself as having bid the price k in reply to the inquiry in step S3, the bidding devices 10 _(m) are not required to send D_(m)(=h^(k)(IV_(m))) to the bid-opening device 20, and hence the communication cost is small as compared with that in the second embodiment accordingly.

As described below, a check is made, if necessary, to see if another bidding device 10 m (different from the device 10 j) has bid a value higher than k.

Step S12: For t such that k≦t≦K and all m's except j (1≦m≦M, m≠j), it is checked whether g(h^(t−k)(h^(k)(IV_(m)))) matches the bidding price information γ_(m) on the bulletin board 25 for t=k, k+1, . . . , K, and if a match is found, then send an error message to each bidding device concerned and discontinue the bid-opening session.

Step S13: If no match is found, then output the winning bidding price k and the identifier ID_(j) of the bidding device having offered the winning bid.

With this check or verification, if a bidding device makes a false response to the inquiry about whether it has bid, for example, with k, this dishonest bidding device is detected; that is, this embodiment satisfies the “undeniability” requirement. When this checking does not takes place, the bid-opening device 20 outputs k and ID_(j) when deciding in step S11 that the bidding device 10 _(j) has bid with k.

In this way, this embodiment keeps losing bids, except the winning one, secret from even the bid-opening device 20 and reduces the communication cost.

While in the above the highest price bid is the winning bid, the lowest price bid can be chosen as the successful bid simply by arranging monotonously decreasing (or increasing) values of the bidding price PR on the conversion table in a one-to-one correspondence with monotonously increasing (or decreasing) values of the price index k.

Fourth Embodiment

This embodiment is intended to permit simplification of the processing in the bid-opening device 20 and reduction of the communication cost.

As depicted in FIG. 12, each bidding device 10 _(m) has a construction in which a random generator 18 and an operation part 19 are added to the bidding device shown in FIGS. 3 and 4. The random generator 18 generates a random number R_(m) known only to the bidding device 10 _(m). The operation part 19 uses the random number R_(m) and the bidding price PR_(m) to perform a predetermined operation such as a bit concatenation, exclusive ORing, addition, or multiplication (which operation will hereinafter be denoted by (+)), then processes the operation result with the one-way function h, and sends the processed output h(PR_(m)(+)R_(m)) to the bid-opening device 20, together with the bidding price information γ_(m)=g(h^(km)(IV_(m))) and the identifier ID_(m).

FIG. 13 illustrates in block form the functional configuration of the bid-opening device 20 in this embodiment, and FIG. 14 is a flowchart for explaining its operation. The bid-opening device 20 has a construction in which one-way function h processors 22′ and 22″ and an operation part 26 are added to the device of FIG. 10 and a subtractor 37 is replaced for the counter 24. For simplicity sake, the program storage part 27S is not shown. At the time of bidding every bidding device 10 _(m) (where m=1, 2, . . . , M) sends h^(K+1)(IV_(m)) to the bid-opening device 20, along with the bidding price information γ_(m) (=g(h^(km)(IV_(m)))), the identifier ID_(m) and the random number information h(PR_(m)(+)R_(m)).

Step S1: Receive γ_(m), C_(m)(=h^(K+1)(IV_(m))), h(PR_(m)(+)R_(m)) and ID_(m) from each bidding device 20 and write and hence publish them on the bulletin board 25.

Step S2: Request all the bidding devices 10 _(m) to present their bidding prices PR_(m) and random numbers R_(m).

Step S3: Upon receiving PR_(m) and R_(m) from each bidding device 10 m, compute (PR_(m)(+)R_(m)) in the operation part 26, then compute h(PR_(m)(+)R_(m)) by the one-way function h processor 22″, and make a check to determine whether the value matches h(PR_(m)(+)R_(m)) published on the bulletin board 25.

Step S4: At this point the bid-opening device 20 learns all the bidding prices. The bid-opening device 20 obtains from the conversion table 25A a price index k_(mx) corresponding to the highest value among the bidding prices PR_(m). The bidding device (the successful bidding device) which has bid k_(mx) will hereinafter be identified by 10 _(j). At this point each bidding device cannot learn the bidding prices of the other bidding devices.

Step S5: Send k_(mx) to all the bidding devices 10 _(m) and request them to present D_(m)h^(kmx)(IV_(m)).

Step S6: Each bidding device 10 _(m) reads out D_(m)=h^(kmx)(IV_(m)) corresponding to k_(mx) from the data storage part 14S described previously with respect to FIG. 4, and sends the read-out Dm to the bid-opening device 20, which writes on the bulletin board 25 all the pieces of data D_(m) sent from the bidding devices 10 _(m).

Step S7: For each Dm, calculates K+1−k_(mx) by a subtractor 37 and generate h^(K+1−kmx)(D_(m)) by the one-way function h processor 22 from K+1−k_(mx) and D_(m).

Step S8: Verify whether h^(K+1−kmx)(D_(m)) matches the corresponding verification information C_(m) on the bulletin board 25. If no mismatch is found, decides that all the responses Dm are correct, and proceed to the subsequent steps. If a mismatch is found, sends an error message to each bidding device and discontinue further operation.

Step S9: If no mismatch is found in step S8, generate g(D_(j)) by the one-way function g processor 23 for D_(j) presented by the successful bidding device 10 _(j).

Step S10: Verify whether g(D_(j)) matches the bidding price information γ_(j) in the bidding data of the bidding device 20 _(j) on the bulletin board 25. If they match, decide that the bidding device 10 _(j) has bid with the price index k_(mx). If they do not match, send an error message to each bidding device and discontinue the current bid-opening session.

As described below, a check is made, if necessary, to see if another bidding device 10 _(m) (different from the device 10 j) has bid a value higher than k_(mx).

Step S11: For t=k_(mx)+1, k_(mx)+2, . . . , K, compute h^(t−kmx)(D_(m)) by the one-way function processor 22′ and process the computed result by the one-way function g processor 23 to obtain g (h^(−kmx)(D_(m))), and verify whether this g(h^(t−kmx)(D_(m))) matches the bidding price information γ_(m) on the bulletin board 25 for all m's except j (1≦m≦M, m≠j).

Step S12: If a match is found, then send an error message to each bidding device concerned and discontinue the current bid-opening session. If no match found, then output the winning bidding price index k_(mx) and the identifier ID_(j) of the bidding device 10 _(j) having offered the winning bid.

For example, in the case where the bidding device 10 m bids with the random number information h(PR_(m)(+)R_(m)) and the bidding price information γ_(m)=g(h^(km)(IV_(m)) (where PR_(m)′>PR_(m)) and presents a price PR_(m)′ higher than the bidding price PR_(m) and the random number R_(m) in reply to the request for the presentation of PR_(m) and R_(m) in step S2 and the price PR_(m)′ becomes the highest bid value, if the bidding device presents D_(m)=(IV_(m)) in reply to the request for the presentation of h^(kmx)(IV_(m)) in step S5, it will pass the verifications in steps S7 and S8, incurring the possibility that the price PR_(m) lower than PR_(m)′ becomes the winning bid. However, this can be prevented because a mismatch is found between g(D_(m))=g(h^(kmx)(IV_(m))) and γ_(m)=g(h^(km)(IV_(m)) in steps S10 and S11.

With the bid-opening device 20, it is possible to specify the winning bid and the corresponding successful bidding device from PR_(m), R_(m) and ID_(m) with ease, reduce the communication cost and verify that the winning bidding price and the winning device determined from PR_(m), R_(m) and ID_(m) are true.

Fifth Embodiment

In this embodiment each bidding device sends to the bid-opening device bidding price information containing select information which indicates whether to bid for each of K kinds of biddable prices. As depicted in FIG. 15, the bidding price transformer 14 of the bidding device 10 m comprises a control part 41, a random generator 42, a one-way function h processor 43, a select information generator 45, a (+) operation part 46 and an adder 47.

Let PR_(m) represent that one of the K kinds of price indexes 1, 2, . . . , K which the bidding device 10 _(m) is to actually to bid. The select information denoted by b_(m) ^((k)) is defined as follows: b_(m) ^((k))=0 when the bidding device 10 ^(m) does not bid for the price index k such that 1≦k≦K, and b_(m) ^((k))=1 when the bidding device 10 _(m) bids for the price index k. Accordingly, only one piece of information b_(m) ^((k)) exists for k such that 1≦k≦K. As mentioned above, the two values of the information b_(m) ^((k)) may be any values as long as they differ from each other. The information b_(m) ^((k)) is known only to the bidding device 10 _(m), which uses it as a random number for each value of the price index k. The bidding device 10 _(m) outputs {ID_(m), h(1(+)b_(m) ⁽¹⁾(+)R_(m) ⁽¹⁾), h(2(+)b_(m) ⁽²⁾(+)R_(m) ⁽²⁾), . . . , h(K(+)b_(m) ^((K))(+)R_(m) ^((K))} as bidding price information.

A description will be given, with reference to FIG. 16, of the procedure by which K pieces of bidding price information are prepared.

Step S1: The bidding price PR_(m) is determined and input.

Step S2: Set the initial value of the price index k to 1.

Step S3: Make a check to see if k≦K.

Step S4: If k≦K, generate the random number R_(m) ^((k)) by the random generator 42.

Step S5: Generate the rice select information b_(m) ^((k)) by the select information generator 45 in accordance with the bidding price PR_(m).

Step S6: The (+) operation part 46 inputs thereinto these pieces of information R_(m) ^((k)) and b_(m) ^((k)), and compute k(+)b_(m) ^((k))(+)R_(m) ^((k)). (+) indicates a predetermined appropriate operation, which may be a concatenation, addition, subtraction, multiplication, or the like.

Step S7: Process the result of this operation by the one-way function h processor 43 to generate h(k(+)b_(m) ^((k))(+)R_(m) ^((k))).

Step S8: Increment k by one by the adder 47, followed by a return to step S3.

Step S9: When k exceeds K and the processing for all values of k ends, the bidding device 10 _(m) sends the identifier ID_(m) and the bidding price information {h(1(+)b_(m) ⁽¹⁾(+)R_(m) ⁽¹⁾), . . . , h(K(+)b_(m) ^((K))(+)R_(m) ^((K)))} to the bid-opening device 20.

By generating the bidding price information for each price through utilization of the one-way function and sending all the pieces of bidding price information to the bid-opening device 20 as described above, the aimed bidding price can be kept secret.

FIG. 17 illustrates in block form the bid-opening device 20 which performs the bid-opening process based on such bidding price information sent thereto. The bid-opening device 20 comprises a control part 21, a one-way function h processor 22, a subtractor 24, an information storage part 35, a bulletin board 25 and a (+) operation part 51. As is the case with FIG. 8, the program storage part 27S is also provided but is not shown for the sake of brevity.

FIG. 18 is a flowchart for explaining the operation of this bid-opening device 20.

Step S0: Receive the bidding price information {ID_(m), h(1(+)b_(m) ⁽¹⁾(+)R_(m) ⁽¹⁾), h(2(+)b_(m) ⁽²⁾(+)R_(m) ⁽²⁾), . . . , h(K(+)b_(m) ^((K))(+)R_(m) ^((K)))} from the bidding device 10 _(m) (where m=1, 2, . . . , M).

Step S1: Write and hence publish the bidding price information on the bulletin board 25.

Step S2: Set the price index k to its highest value K.

Step S3: Request each bidding device 10 _(m) to present the random number R_(m) ^((k)).

Step S4: The bidding devices 10 _(m) each send the random number R_(m) ^((k)) to the bid-opening device 20, which writes all the random numbers R_(m) ^((k)) on the bulletin board 25.

Step S5: Set b_(m) ^((k))=1, then input b_(m) ^((k)) and R_(m) ^((k)) to the (+) operation part 51 to perform an operation k(+)1(+)R_(m) ^((k)), and process the result of operation by the one-way function h processor 22 to obtain h(k(+)1(+)R_(m) ^((k))).

Step S6: For each m, make a check to see if a match is found between the calculated h(k(+)1(+)R_(m) ^((k))) and h(k(+)1(+)R_(m) ^((k))) on the bulletin board 25.

Step S7: If no match is found, decrement k such that k←k−1, and return to step S3.

Step S8: If a match is found, determine the k as the successful price index k, then output the price index k and the identifier ID_(m) of the bidding device 10 _(m) concerned, and discontinue the current bid-opening session.

As described above, according to this embodiment, the bidding price information corresponding to each price index is generated using the one-way function and all the pieces of bidding price information are sequentially opened in decreasing order from the highest value. This enables non-winning bids to be kept secret.

In the case of choosing the lowest price bid as the successful bid in this embodiment, the bidding device 10 _(m) similarly sends the bidding price information {ID_(m), h(1(+)b_(m) ⁽¹⁾(+)R_(m) ⁽¹⁾), h(2(+)b_(m) ⁽²⁾(+)R_(m) ⁽²⁾), . . . , h(K(+)b_(m) ^((K))(+)R_(m) ^((K)))} to the bid-opening device 20. The bid-opening device 20 carries out about the same processing as depicted in FIG. 18, but in step S2 the lowest value 1 of the K kinds of biddable price indexes is set to k and in step S6 the index k is incremented by one such that k←k+1.

In the case of choosing the highest price bid as the winning bid in this embodiment, since random numbers R_(m) ^((t)) received from all the bidding devices for t (where k≦t≦K) are recorded on the bulletin board 25 in step S4, it is possible to detect that b_(m) ^((k))=0 for the index larger than the winning price index k, by calculating h(t(+)b_(m) ^((t))(+)R_(m) ^((t))) and comparing it with h(k(+)b_(m) ^((k))(+)R_(m) ^((k))) published on the bulletin board 25. Accordingly, any one can determine if the winning price index k is correct.

In this embodiment it is also possible for each bidding device 10 _(m) to send the set of random numbers {R_(m) ^((k))} (k=1, . . . , K) to the bid-opening device 20 in advance together with ID_(m) and h(k(+)b_(m) ^((k))(+)R_(m) ^((k))). In this case, however, the random number R_(m) ^((k)) is not written on the bulletin board 25 but is stored in the broken-lined information storage part 35. In FIG. 19 there is shown a flowchart for explaining the processing which the bid-opening device 20 performs in such an instance.

Step S0: Receive the bidding price information {ID_(m), h(1(+)b_(m) ⁽¹⁾(+)R_(m) ⁽¹⁾), h(2(+)b_(m) ⁽²⁾(+)R_(m) ⁽²⁾), . . . , h(K(+)b_(m) ^((K))(+)R_(m) ^((K)))} and random number information {R_(m) ⁽¹⁾, R_(m) ⁽²⁾, . . . , R_(m) ^((K))} from the bidding devices 10 _(m) (where m=1, 2, . . . , M).

Step S1: Write and hence publish only the bidding price information on the bulletin board 25 and store the random number information in the storage part 35 indicated by the broken line.

Step S2: Set the highest possible value K for the price index k.

Step S3: For all m's, generate h(k(+)1(+)R_(m) ^((k))) read out of the storage part 35 with b_(b) ^((k))=1.

Step S4: Verify whether a match is found between h(k(+)1(+)R_(m) ^((k))) and the pieces of bidding rice information written on the bulletin board 25.

Step S5: If no match is found, decrement the price index k by one to k←k−1

and return to step S3.

Step S6: For the index k for which the mach was found, write and publish all the random numbers R_(m) ^((t)) (k≦t≦K) on the bulletin board 25.

Step S7: Determine k at this time as the winning price index, then output this index k and the identifier ID_(m) of the bidding device 10 _(m) having submitted the winning bid, and discontinue the current bid-opening session.

When the lowest bidding price bid is chosen as the successful bid in this case, the index k is set to the smallest possible value, 1 in this example, in step S2 in FIG. 19, then in step S4 the index k is incremented by one, and in step S5 all random numbers R_(m) ^((t)) which are 1≦t≦k are published on the bulletin board 25. The other operations are the same as those described above with reference to FIG. 19.

While in the above the select information b_(m) ^((k)) has been described to be “0” or “1,” they may be any values as long as they are two predetermined different integers.

Sixth Embodiment

In the second embodiment described previously, at the time of bidding each bidding device 10 _(m) sends the bidding price information γ_(m)=g(h^(km)(IV_(m))) and the verification information C_(m)=h^(k+1)(IV_(m)) to the bid-opening device 20, and at the time of bid-opening the bid-opening device 20 requests the bidding device 10 _(m) to send the information D_(m)=h^(k)(IV_(m)), and verifies whether h(D_(m)) and C_(m) match for the information D_(m) received from the bidding device 10 _(m); if they match, then the bid-opening device 20 further verifies whether g(D_(m)) matches the bidding price information γ_(m). These verifications need to be made for all of m=1, 2, . . . , M. Accordingly, the amount of data to be processed increases with an increase in the number M of bidding devices used. In addition, the larger the highest value K of the index k, the more the amount of multiple processing by the one-way function h; hence it is necessary to process an enormous amount of data.

To avoid this, the sixth embodiment utilizes one-way functions to transform the bidding price index k_(m) to gm=H_(m) ^((K))=h^(K−km))g^(xm)(IV_(m))), which is sent to the bid-opening device 20. x_(m) is an arbitrary integer equal to or greater than 1 which is determined by the bidding device 10 _(m). When inquired about whether it has bid with the index k, the bidding device 10 _(m) presents H_(m) ^((k−1))=h^(k−km−1)(g^(xm)(IV_(m))) if k is not its aimed bidding price index k_(m), and if it is the aimed value, the bidding device 10 _(m) presents H_(m) ^((k−1))=g^(xm−1)(IV_(m)). The bid-opening device 20 verifies the former with h(H_(m) ^((k−1)))=H_(m) ^((K)) and the latter with g(H_(m) ^((k−1)))=H_(m) ^((K)).

The M bidding devices 10 _(m) indirectly bit the bidding price index values k_(m) to the bid-opening device 20, which detects the largest one of the index values k_(m) bit by the bidding devices 10 _(m). Each bidding device 10 _(m) and the bid-opening device 20 have a conversion table in which K bidding prices PR₁, PR₂, . . . , PR_(K) are held in a one-to-one correspondence with K kinds of index values 1, 2, . . . , K in increasing order. In this embodiment, as the index value k (where k=1, 2, . . . , K) increases, the value PR_(k) becomes larger; for example, PR₁=10, PR₂=15, PR₃=30, . . . , PR_(K)=3000.

FIG. 20 illustrates in block form the functional configuration of the bidding device 10 _(m) and FIG. 21 is a flowchart showing its bidding procedure. The bidding device 10 _(m) comprises an input part 11, a control part 13, a bidding price transformer 14, a transceiver 18 and a storage part 12 all of which are interconnected via a common bus 10B. The bidding price transformer 14 is made up of a conversion table 15, a one-way function h processor 16 and a one-way function g processor 17. The control part 13 reads out a bidding procedure program stored in the storage part 12, and follows it to control the respective parts to perform bidding as described below.

Step S1: The bidding device 10 _(m) receives via the input part 11 a value PR_(m) selected from values PR₁, PR₂, . . . , PR_(K), an initial value (a positive integer) IV_(m) and an arbitrary integer x_(m) equal to or greater than 1.

Step S2: The control part 13 stores IV_(m) and x_(m) in the storage part 12.

Step S3: The control part 13 refers to the conversion table 15 with PR_(m) to convert it to an index value k_(m) and stores it in the storage part 12.

Step S4: The initial value IV_(m) and the bidding price x_(m) are read out from the storage part 12, then input to the one-way function g processor 17, wherein the initial value is processed x_(m) times with the one-say function g to obtain g^(xm)(IV_(m)).

Step S5: If necessary, g^(xm)(IV_(m)) is stored in the storage part 12.

Step S6: g^(xm)(IV_(m)), K and k_(m) are input to the one-way function h processor 16, wherein g^(xm)(IV_(m)) is processed K−k_(m) times with the one-way function h to obtain H _(m) ^((K)) =h ^(K−km)(g ^(xm)(IV _(m))).

Step S7: H_(m) ^((K)) is sent as the bidding price information to the bid-opening device 20 via the transceiver 18.

In this way, the bidding device 10 _(m) sends the aimed bidding price index value k_(m) to the bid-opening device 20.

Step S8: Upon beginning the bid-opening procedure by the bid-opening device 20 after the bidding, each bidding device 10 _(m) receives an inquiry with the price index k from the bit-opening device 20 by the transceiver 18 as depicted in FIG. 21.

Step S9: A check is made to see if the inquiry index value k is equal to the bidding price index k_(m) stored in the storage part 12.

Step S10: If not equal, g^(xm)(IV_(m)) is read out of the information storage part 12 and is input to the one-way function h processor 16 together with k_(m) and k, wherein g^(xm)(IV_(m)) is processed k−k_(m)−1 times with the one-way function h to obtain response information H_(m) ^((k−1)) by the following equation: H _(m) ^((k−1)) =h ^(k−km−1)(g ^(xm)(IV _(m)))

Step S11: The bidding device 10 _(m) sends the response information H_(m) ^((k−1)) to the bid-opening device 20 via the transceiver 18 and waits for the next inquiry about k.

Step S12: If the inquiry about k corresponds to its aimed value, that is, if the index k is equal to k_(m) in the storage part 12, the bidding device 10 _(m) inputs the initial value IV_(m) and x_(m−1) to the one-way function g processor 17, wherein the initial value IV_(m) is processed xm−1 times to obtain response information H_(m) ^((k−1))=g^(xm−1)(IV_(m))

Step S13: The bidding device 10 _(m) sends the response information H_(m) ^((k−1)) to the bid-opening device 20.

The functional configuration of the bid-opening device 20 is depicted in FIG. 22 and its bid-opening procedure in FIG. 23. The bid-opening device 20 comprises a control part 21, a program storage part 27S, a one-way function h processor 22, a one-way function g processor 23, a counter 24, a bulletin board 25, a conversion table 25A, a transceiver 28, and an information storage part 25, all of which are interconnected via a common bus 20B.

Step S1: Upon receiving the bidding information γ_(m)=H_(m) ^((K)) from each bidding device 10 _(m) by the transceiver 28, the control part 21 writes the bidding information H_(m) ^((K)) on the bulletin board 25 to publish it.

Step S2: Set K as the initial value of k in the counter 24.

Step S3: Send the index value k on the counter 24 to each bidding device 10 _(m), and send thereto an inquiry about bidding via the transceiver 28.

Step S4: Receive the response information H_(m) ^((k−1)) by the transceiver 28 from all the bidding devices 10 _(m).

Step S5: Input H_(m) ^((k−1)) to the one-way function h processor 22 to process it with the one-way function h to obtain h(H_(m) ^((k−1))).

Step S6: Check whether the result of operation h(H_(m) ^((k−1))) is equal to the bidding information A_(m) for m in the storage part 35.

Step S7: If h(H_(m) ^((k−1)))=H_(m) ^((K)), store the received information H_(m) ^((k−1)) as updated bidding information H_(m) ^((K)) in the storage part 35 to update H_(m) ^((K)).

Step S8: Decrement the count value k of the counter 24 by one, then return to step S3, and inquire of each bidding device 10 _(m) about whether it has made a registration for the value k.

Step S9: When it is found in step S6 that the response information H_(m) ^((k−1)) from the bidding device 10 _(m) is g^(xm−1)(IV_(m)) which is equal to the aimed index value, h(H_(m) ^((k−1))) does not become equal to H_(m) ^((K))=h^(ek+1−km−1)(g^(xm)(IV_(m)))=g^(xm)(IV_(m)) in step S9. Then, input H_(m) ^((k−1)) to the one-way function g processor 23 to process H_(m) ^((k−1)) with the one-way function g to obtain g(H_(m) ^((k−1))).

Step S10: Make a check to see if g(H_(m) ^((k−1))) is equal to H_(m) ^((K)) corresponding to m stored in the storage part 35.

Step S11: When the bidding device 10 _(m) has performed correct processing, h^(km+1−km−1)(g^(xm)(IV_(m)))=g^(xm)(IV_(m))=H_(m) ^((K)) by the process of step S7 at the time of previous inquiry for k=k_(m+1); hence, g(H_(m) ^((k−1)))=H_(m) ^((K)) holds. In the inquiry processing for the index k which is decremented one by one, the index k for which g(H_(m) ^((k−1)))=H_(m) ^((K)) holds for the first time is the maximum value among the bidding price indexes of all the bidding devices, and this index k is converted to the value PR_(k) by referring to the conversion table 25A.

Step S12: Output the value PR_(k) as the highest one of the bid values, and if necessary, output the number m of the winning bidding device 10 _(m) as well.

In the bidding procedure of FIG. 21, if k=k_(m) in step S9 when inquired about whether it has bid k, the bidding device 10 _(m) may send to the bid-opening device 29 in step S13 not only the response information H_(m) ^((k−1)) but also information indicating k=k_(m) (which information will hereinafter be referred to as identity information). In this instance, upon receiving the response information H_(m) ^((k−1)) in step S4 in FIG. 23, the bid-opening device 20 makes a check for the identity information; if not having received it, the device 20 performs the operation h(H_(m) ^((k−1))) and if having received the information, g(H_(m) ^((k−1))). Incidentally, in the event that g(H_(m) ^((k−1)))≠H_(m) ^((K)) in step S10 in FIG. 23, the bid-opening device 20 may discontinue the current bid-opening session for the reasons of dishonesty by the bidding device concerned and request all the bidding devices 10 _(m) to rebid; alternatively, the bid-opening device 20 may abandon inquiring that bidding device but may continue inquiring the other bidding device.

In the case where the bidding prices PR_(k) are arranged on each of the conversion tables 15 and 25A in such a decreasing order as 3000, 2950, 2900, . . . , 100 in correspondence with the K index values 1, 2, . . . , K, the price PR_(k) corresponding to the index value k for which g(H_(m) ^((k−1)))=H_(m) ^((K)) holds for the first time in the inquiry about bidding k represents the lowest one of the aimed bidding prices of all the bidding devices 10 _(m). The maximum value of the index may also be obtained without using the conversion table 15. In this instance, the bidding device 10 _(m) sends the index value k_(m), and after step S10 in FIG. 23 the bid-opening device 20 outputs the index value k as the highest value and, if necessary, together with the number m (or ID_(m)) of the bidding device 10 _(m) having sent the index value k_(m).

In the bid-opening procedure depicted in FIG. 23, the bid-opening device 20 inquires every bidding device 10 _(m) for each value of the index k=K, K−1, K−2, . . . , and receives H_(m) ^((k−1)), and then processes it using the one-say function h in step S5; hence this procedure requires high communication cost and computational complexity. In FIG. 24 there is depicted a modified form of the above-mentioned bid-opening procedure whose communication cost and computational complexity are reduced using the scheme described previously with reference to FIG. 11. No description will be given of the bidding procedure since it is exactly the same as in the FIG. 11 embodiment.

Step S0: Receive bidding price information H_(m) ^((K))=h^(K−km)g^(xm)(IV_(m))) and the identifier ID_(m) from each bidding device.

Step S1: Publish the received H_(m) ^((K)) and ID_(m) on the bulletin board 25.

Step S2: Set the initial value of the index k at K.

Step S3: Inquire of all the bidding devices 10 _(m) about whether they bid for the index k.

Step S4: Check the responses for YES (which means that the bidding device concerned has bid for the index k).

Step S5: If no YES is found, decrement k by one and returns to step S3 to repeat the same processing.

Step S6: If YES is found, request all the bidding devices 10 _(m) to send their bidding price information H_(m) ^((k−1)). The response of the bidding device to this request is the same as described previously in connection with FIG. 21.

Step S7: Publish the received information H_(m) ^((k−1)) on the bulletin board 25.

Step S8: For the response H_(m) ^((k−1)) of an m (representing the bidding device 10 _(m)) having bid for the index k, compute H _(m) =h ^(K−k)(g(H _(m) ^((k−1)))

and for the responses H_(m) ^((k)) from the other m's (the other bidding devices), compute H _(m) =h ^(K+1−k)(H _(m) ^((k−1))).

Step S9: Check whether H_(m)=H_(m) ^((k)) holds for all the m's, and if a mismatch is detected for even one of them, send an error message to all the bidding devices and discontinue the current bid-opening session.

Step S10: If a match is detected for every one of them, determine that the bidding device 10 _(m) of the number m having responded YES is the winning bidder, and output the index k at that time and its identifier ID_(m) for publication

The bidding device 10 m and the bid-opening device 20 can each be implemented by a computer.

Seventh Embodiment

In the fifth embodiment described previously, each bidding device 10 _(m) generates the select information b_(m) ^((k)) indicating whether to bid for every price index k=1, 2, . . . , K, and these pieces of select information are contained in K pieces of information h(k(+)b_(b) ^((k))(+)R_(m) ^((k))), where k=1, 2, . . . , K. In this embodiment, however, the plural pieces of select information are contained in a single piece of bidding price information through multiple processing with the one-way function h.

FIG. 25 illustrates in block form the functional configuration of each bidding device 10 _(m). Assume that K bidding prices PR and the k price indexes k=1, 2, . . . , K, which have a one-to-one correspondence with each other, are both arranged in monotone increasing order in the same direction. The bidding select information for each index k will be identified as b^((k)). In this embodiment a select information generating part 54 does not generate the select information b_(m) ^((k)) for all the indexes k=1, 2, . . . , K but instead generates the select information b_(m) ^((k)) only for indexes higher than the bidding price index k_(m). H_(m) ^((k))=h(H_(m) ^((k−1))∥b_(m) ^((k))) is calculated, with H_(m) ^((km−1))=IV_(m) as its initial value, for each value of the price index k (=k_(m), k_(m)+1, . . . , K) by a one-way function h processor 16, a concatenator 55 and a buffer 56, and the calculation result H_(m) ^((k)) for each value of k is stored in a data storage part 14S. The final calculation result H_(m) ^((K)) will hereinafter be called bidding price information. In this embodiment, a signature Sig_(m)(H_(m) ^((K))) is generated by a signature generator 14S for the bidding price information 57.

FIG. 26 is a flowchart showing the bidding procedure of the bidding device 10 _(m) depicted in FIG. 25.

In this embodiment, letting k_(m) be the index that the bidding device 10 _(m) bids, a select information generating part 54 generates K−k_(m)+1 pieces of select information b_(m) ^((km)), b_(m) ^((km+1)), . . . , b_(b) ^((K)) corresponding to the indexes larger than the bidding price index k_(m) (step S1). Then, H_(m) ^((km−1)), H_(m) ^((km)), H_(m) ^((km+1)), . . . , H_(m) ^((K)) are successively generated by the following equations H_(m) ^((km−1))=IV_(m) H _(m) ^((km)) =h(H _(m) ^((km−1)) ∥b _(m) ^((km))) H _(m) ^((km+1)) =h(H _(m) ^((km)) ∥b _(m) ^((km+1))) : H _(m) ^((t)) =h(H _(m) ^((t−1)) ∥b _(m) ^((t))) : H _(m) ^((K)) =h(H _(m) ^((K−1)) ∥b _(m) ^((K)))

and they are stored in the data storage part 14S (step S2). Further, a signature σ_(m)=Sig_(m)(H_(m) ^((K))) of the bidding device 10 _(m) corresponding to the bidding price information H_(m) ^((K)) is generated by the signature generator 14S (step S3). The bidding device 10 _(m) sends H_(m) ^((K)), σ_(m) and ID_(m) as bidding information to the bid-opening device 20 (step S4). After this, the bid-opening procedure is started, and upon receiving an inquiry for each value of the index k, the bidding device reads out {H_(m) ^((k−1)), b_(m) ^((k))} from the data storage part 14S, and sends it to the bid-opening device (step S5).

The bid-opening device 2—comprises, as depicted in FIG. 27, a control part 21, a one-way function h processor 22, a counter 24, a bulletin board 25, an information storage part 35, comparators 58 and 59 and a signature verifier 33. The pieces of bidding information H_(m) ^((K)), σ_(m) and ID_(m) are written on the bulletin board 25. Then, the received information H_(m) ^((k−1)) is processed by the one-way function h processor 22 to obtain H_(m) ^((k))=h(H_(m) ^((k−1))), which is compared by the comparator 58 with H_(m) ^((k)) read out of the bulletin board 25 to thereby verify whether they match. Further, it is checked by the comparator 59 whether the received select information b_(m) ^((k)) is 1, and if it is 1, then the bidding device 10 _(m) corresponding to m at that time is determined as the winning bidder.

FIG. 28 is flowchart showing the bid-opening procedure of the bid-opening device 20.

The bid-opening device 20 verifies respective signatures σ_(m) (where m=1, 2, . . . , M) and writes and publish the received pieces of information H_(m) ^((K)), σ_(m) and ID_(m) on the bulletin board 25.

The bid-opening device 20 sends k to the bidding device in the order [k=K, K−1, K−2, . . . ] and asks for information {H_(m) ^((k−1)), b_(m) ^((k))} corresponding to each index k. The information {H_(m) ^((k−1)), b_(m) ^((k))} received from each bidding device 10 _(m) is published on the bulletin board 25, then it is checked whether H_(m) ^((k)=h(H) _(m) ^((k−1)),b_(m) ^((k))) holds for the information H_(m) ^((k)) received previously, and if it holds, it is checked whether the select information b_(m) ^((k)) is 1. When b_(m) ^((k)) is 0 for all of m=1, 2, . . . , M, the bid-opening device 20 decrements k to k←k−1, then sends again k to the bidding device and asks for the information {H_(m) ^((k−1)), b_(m) ^((k))}, thereafter performing the same operation as described above. If the select information b_(m) ^((k)) is 1 for any one of m=1, 2, . . . , M, then the bidding device 10 _(m) corresponding to that m is determined as the winning bidder. The bid-opening device 20 publishes the successful bidding price index k_(m) and the identifier ID_(m) of the wining bidding device 10 _(m) on the bulletin board 25.

According to this embodiment, since each bidding device does not perform the multiple processing with the one-way function for indexes smaller than the bidding price index k_(m), the computational complexity is low accordingly.

The bid-opening device performs the bid-opening procedure as described below.

Step S0: Receive the pieces of bidding information H_(m) ^((K)), σ_(m) and ID_(m) from each bidding device, then verifies respective signature σ_(m) (where m=1, 2, . . . , M), and writes and publishes the pieces of information H_(m) ^((K)), σ_(m) and ID_(m) on the bulletin board 25.

Step S1: Set the initial value of the index k to K.

Step S2: Send k to each bidding device 10 _(m) and ask for {H_(m) ^((k−1)), b_(m) ^((k))}.

Step S3: Write and publish on the bulletin board 25 the information {H_(m) ^((k−1)), b_(m) ^((k)) } received from each bidding device 10 _(m).

Step S4: Process the received information {H_(m) ^((k)), b_(m) ^((k))} by the one-way function h processor 22, thereby generating H=h(H_(m) ^((k−1))∥b_(m) ^((k))).

Step S5: Verify by the comparator 58 whether H generated in step S4 matches the previously received H_(m) ^((k)). If a mismatch is detected, then send an error message to the bidding device and discontinue the current bid-opening session.

Step S6: If no mismatch is found in step S5, then decides that the response from every bidding device is valid, and make a check by the comparator 59 to see if the received select information b_(m) ^((k)) is 1.

Step S7: When the select information b_(m) ^((k)) from all bidding devices 10 _(m) is 0, update k with k−1 and return to step S2.

Step S8: When any one of M pieces of select information b_(m) ^((k)) is 1 in step S6, determine that the bidding device 10 _(m) corresponding to m, which provides that information b_(m) ^((k)), is the winning bidder, and write and publish its identifier ID_(m) and the index k_(k) of the winning bid on the bulletin board 25, and end the bid-opening procedure.

In this embodiment the prices bid by the unsuccessful bidders are each kept secret from the other participants. The lowest price bid can be made a successful bid by using a conversion table wherein the price PR monotonously increases in the direction opposite to that in which the index k monotonously increases.

Incidentally, it is also possible to set H_(m) ⁽⁰⁾=IV_(m), H_(m) ⁽¹⁾=h(H_(m) ⁽⁰⁾∥b_(m) ⁽¹⁾), . . . , H_(m) ^((K))=h(H_(m) ^((K−1))∥b_(m) ^((K))), where b_(m) ⁽¹⁾=b_(m) ⁽²⁾= . . . =b_(m) ^((km−1))=0.

The communication cost and computational complexity involved in the bid-opening procedure of FIG. 27 can also be reduced, as depicted in FIG. 27′, by the application of the scheme described previously with reference to FIG. 11. The bidding procedure is exactly the same as in FIG. 25, and hence it will not be described.

Step S0: Receive the bidding price information H_(m) ^((K))=h( . . . h(h(H_(m) ^((km−1))∥b_(m) ^((km)))∥b_(m) ^((km+1))) . . . ∥b_(m) ^((K))) and the identifier ID_(m) from each bidding device.

Step S1: Publish the received H_(m) ^((K)) and ID_(m).

Step S2: Set the initial value of the index k at K.

Step S3: Inquire of all the bidding devices 10 _(m) about whether they bid for the index k.

Step S4: Check the responses for YES (which means that the bidding device concerned has bid for the index k).

Step S5: If no YES is found, decrement k by one and returns to step S3 to repeat the same processing.

Step S6: If YES is found, request all the bidding devices 10 _(m) to send their bidding price information H_(m) ^((k−1))=h( . . . h(h(H_(m) ^((km−1))∥b_(m) ^((km)))∥b_(m) ^((km+1))) . . . ∥b_(m) ^((K))). The response of the bidding device to this request is the same as described previously in connection with FIG. 21. For the bidding device having bid for the current index k, k=k_(m); therefore, H_(m) ^((k−1))=H_(m) ^((km−1))=IV_(m).

Step S7: Publish the received information H_(m) ^((k−1)) on the bulletin board 25.

Step S8: For the response H_(m) ^((k−1)) of an m (representing the bidding device 10 _(m)) having bid for the index k, compute H _(m) =h( . . . h(h(H _(m) ^((k−1))∥1)∥0)∥ . . . 0)

and for the responses H_(m) ^((k−1)) from the other m's (the other bidding devices), compute H _(m) =h( . . . h(h(H _(m) ^((k−1)))∥0)∥0) . . . ∥0).

Step S9: Check whether H_(m)=H_(m) ^((k)) holds for all the m's, and if a mismatch is detected for even one of them, send an error message to all the bidding devices and discontinue the current bid-opening session.

Step S10: If a match is detected for every one of them, determine that the bidding device 10 _(m) of the number m having responded YES is the winning bidder, and output the index k at that time and its identifier ID_(m) for publication.

Eighth Embodiment

In each of the embodiments described above, the bidding prices for the bidding price indexes k=1, 2, . . . , K in the conversion table are discrete values such as 1000, 2000, 3000, . . . , 10000, and each bidding device bids any one of the K prices but cannot bid a value intermediate between such discrete prices unless K prices are set in “1” increments. This embodiment is intended to permit bidding an arbitrary price intermediate between the discrete values. In this embodiment, an arbitrary bidding price PR within the range defined by the highest and lowest bidding prices is expressed by the following equation. PR=F(k)+Q where: 0≦Q<F(k+1)−F(k)

F(k) represents the price corresponding to the index k specified on the conversion table, and Q will hereinafter be referred to as a fraction.

This embodiment is one that the bidding price PR defined above is applied to the first embodiment described previously. Bidding price information g(h^(k)(IV_(m))) and Q_(m) are sent to the bid-opening device 20. Further, h^(K+1)(IV_(m)) is sent as verification information to the bid-opening device 20 together with the bidding price information. These pieces of information are published on the bulletin board as is the case with the first embodiment.

FIG. 30 is a block diagram illustrating the configuration of each bidding device 10 _(m), which is identical with the bidding device of the first embodiment except that the bidding price transformer 14 is provided with a fraction calculating part 14 a. The fraction calculating part 14A calculates, for a desired bidding price PR_(m), Q_(m)=PR_(m)−F(k_(m)) from the index k_(m) read out of the conversion table 15. As is the case with the first embodiment, the one-way function h processor 16 and the one-way function g processor 17 are used to compute γ_(m)=g(h^(km)(IV_(m))) from the index k_(m) which satisfies F(k_(m)+1)>PR_(m)≧F(k_(m)) and the initial value IV_(m). In this embodiment, γ_(m), Q_(m) and ID_(m) are sent as bidding information to the bid-opening device 20.

The bid-opening device 20 has, as depicted in FIG. 31, a sequencer 61 added to the bid-opening device 20 in FIG. 6 embodiment. The pieces of bidding information γ_(m), Q_(m) and ID_(m) are written and published on the bulletin board 25. The sequencer 61 reads out Q₁, Q₂, . . . , Q_(M) from the bulletin board 25, then sequences them in descending order, and sequences m=1, 2, . . . , M corresponding to the sequenced Q_(m), thereafter outputting them in the sequential order. The control part 21 checks, for each index k, whether ID_(m) and γ_(m) match each other in the sequence of m defined by the sequencer 61. The bidding device 10 _(m), which corresponds to m for which the match was detected for the first time, is determined as the winning bidder.

FIG. 32 is a flowchart depicting the bid-opening procedure of the bid-opening device 20 shown in FIG. 31, which steps S0 to S7 are identical with steps S0 to S7 in FIG. 7 but differ in step 8 and the subsequent steps. Roughly speaking, steps S8 and S9 are new steps added between steps S7 and S8 in FIG. 7. Step S8 and the subsequent steps will be described below.

In step S8 the bid-opening device 20 makes a check to determine whether the matching in steps S6 to S11 has been completed for all fractions Q_(m) for the current value of k. If not completed, the procedure goes to step S9. In step S9, the bid-opening device 20 selects the largest one of the remaining fractions Q_(m) to determine the corresponding m. In step S10, the device 20 reads out of the data storage part 36 updated data D_(m) ^((k))=h^(k)(IV_(m)) corresponding to that m, and processes the read-out data by the one-way function g processor 23, thereby updating it such that D_(m) ^((k))←g(D_(m) ^((k))). In step S11, the control device 21 makes a check to see if the updated data D_(m) ^((k)) corresponding to m matches the bidding price information γ_(m) corresponding to m on the bulletin board 25, and if not, then the procedure returns to step S8.

When it is decided in step S8 that the matching for all the fractions Q_(m) for the current k has been completed, the bid-opening device 20 decrements k by one in step S12, and returns to step S8, repeating the same procedure as mentioned above. When it is decided in step S11 that the updated data D_(m) ^((k)) and the bidding price information γ_(m) match, the bid-opening device 20 determines in step S13 that the index k at that time is the successful index, and outputs the identifier ID_(m) corresponding to that information γ_(m) and the successful bidding price F(k)+Q_(m) (or merely the index k).

Since D_(m) ^((k)) and gm are matched for the current value of the index k in the descending order of the fractions Q_(m) as described above, the highest bidding price can be determined at the first detection of matching between D_(m) ^((k)) and γ_(m). The value m selected in step S9 is determined by the sequencer 61 which sequences in descending order the fractions Q₁, Q₂, . . . , Q_(M) read out of the bulletin board 25, and sequences m correspondingly, as explained before.

In the case where the lowest bidding price bid is a successful bid, the bidding prices are arranged in monotonous increasing order in the direction opposite to that in which the values of the index k are arranged in monotonous decreasing order, and the sequencer 61 sequences the fractions Q₁, Q₂, . . . , Q_(M) in ascending order, and sequences m correspondingly. In step S9 the smallest one of the unprocessed fractions Q_(m) is chosen, and the corresponding m is determined. The sequencer 61 determines the order of m.

The technique that uses may fractions Q_(m) as described above can be applied not only to the first embodiment but also to the other embodiments explained heretofore.

Electronic Competitive Auction System With Provisional Identifier Device

In the embodiments described above, since the bidding device identifier ID_(m) is contained in the bidding information and sent to the bid-opening device 20, it can be said that these embodiments employ what is called a sealed-bit auction system. FIG. 33 illustrates in block form an electronic competitive auction system which uses a provisional identifier registration device to implement a secret-bit auction.

Each bidding device 10 _(m) is adapted to communicate with a provisional identifier registration device 70. Referring to FIG. 34, the operation of this electronic competitive auction system will be described below.

Step S0: Notice of auction is input to each bidding device 10 _(m).

Step S1: Upon receiving the notice of auction, the bidding device 10 _(i) outputs the identifier ID_(m) to the provisional identifier registration device 70.

Step S2: For the identifier ID_(m) provided thereto, the provisional identifier registration device 70 issues a provisional identifier AID_(m), then stores ID_(m) and AID_(m) in pair form on a recording medium 71, and sends the provisional identifier AID_(m) to the bidding device 10 _(i).

Step S3: The bidding device 10 _(m): generates the bidding price PR_(m);

Step S4: Transforms the bidding price PR_(m) to the bidding price information γ_(m); and

Step S5: Sends the bidding price information γ_(m) and the provisional identifier AID_(m) to the bid-opening device 20.

Step S6: The bid-opening device 20: calculates a successful bid from the bidding price indexes received from all the bidding deices; and

Step S7: Outputs the successful bid and the provisional identifier of the bidding device having offered the successful bid.

Thus, it is possible to keep the auction participants secret. Incidentally, when inquiring the provisional identifier registration device 70, the bid-opening device 20 can learn the identifier ID_(m) corresponding to the successful bid from the provisional identifier AID_(m). This method can be applied to all of the embodiments explained hereinbefore.

The bidding device 10 _(m) and the bid-opening device 20 can be implemented by interpreting and executing programs with a computer.

EFFECT OF THE INVENTION

As described above, according to the present invention, since the bidding price is transformed to a bidding price information through utilization of a one-way function and is then sent to the bid-opening device, it is possible to keep the bidding price of each bidding device secret from the other bidding devices prior to bidding, ensuring fairness of auction.

By publishing h^(K+1)(IV_(m)) and h^(kmx)(IV_(m)) corresponding to a winning bidding price on the bulletin board, it is possible for all bidding devices to verify whether the winning bidding price was correctly bid without being altered.

Furthermore, the present invention permits determination of the winning bid while hiding the other bidding prices.

According to the second embodiment, the bids of losing bidders, except the winning bid, are kept secret even from the bid-opening device.

According to the third embodiment, the bids of losing bidders, except the winning bid, are kept secret even from the bid-opening device, and in addition, the amount of data for communication with the bidding device can be reduced.

According to the fourth embodiment, there is no fear of the bidding price of each bidding device being revealed to the other devices, and at the bid-opening time the successful bid can easily be specified directly from the bidding price; furthermore, the validity of the winning bid can be verified.

According to the fifth embodiment, bidding price information including each bidding price index is generated using a one-way function, and the bidding price information for all bidding price indexes is sent to the bid-opening device; hence, the aimed bidding price can be kept secret.

According to the sixth embodiment, either h(H_(m) ^((k−1)))=H_(m) ^((K)) or g(H_(m) ^((k−1)))=H_(m) ^((K)) needs only to be verified for each index value and for each bidding device.

According to the seventh embodiment, each bidding device generates the bidding price information including select information for only indexes larger than the bidding price index k_(m) in the fifth embodiment, the computational complexity can be reduced.

According to the eighth embodiment, since a desired bidding price is expressed by the sum of fractions Q of a price F(k) corresponding to the index k, an arbitrary price can be bid with a small number of indexes. 

1. A quantitative competition method for a system in which a plurality of participant devices send their secret aimed values to a server device and said server device determines which of said plurality of participant devices has offered the maximum or minimum one of said aimed values received, and in which there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, and m=1, 2, . . . , M, M being an integer equal to or greater than 2; said method comprising the steps wherein: (a) each of said participant devices processes, with a predetermined one-way function h and through the use of said conversion table, information k(+)b_(m) ^((k))(+)R_(m) ^((k)), which contains each index k equal to or larger than an index k_(m) corresponding to said aimed value, select information b_(m) ^((k)) indicating whether said index k corresponds to said aimed value, and a random number R_(m) ^((k)), to generate at least K−k_(m)+1 pieces of aimed value information h(k(+)b_(m) ^((k))(+)R_(m) ^((k))), and sends these pieces of aimed value information to said server device, A(+)B representing a predetermined arbitrary operation; (b) said server device publishes its received aimed value information on a bulletin board accessible from all of said participant devices; (c) said server device obtains said random number R_(m) corresponding to each of said sequence of indexes k; (d) letting a be a predetermined value with which said select information b_(m) ^((k)) indicates said aimed value, said server device calculates h(k(+)a(+)R_(m) ^((k))); (e) said server device checks said aimed values on said bulletin board for matching with said calculated h(k(+)a(+)R_(m) ^((k))); and (f) if a match is detected in said step (e), said server device decides that the aimed value of the aimed value information of a participant device having sent said random number R_(m) ^((k)) at that time is the maximum or minimum value.
 2. The method of claim 1, further comprising a step wherein if a match is detected in said step (d), said server device repeats said steps (c), (d) and (e) for the next value of said index k.
 3. The method of claim 2, wherein said step (c) includes the steps wherein: said server device requests said each participant device to send said random number R_(m) ^((k)) corresponding to said index k; said each participant device sends said requested random number R_(m) ^((k)) to said server device; and said server device receives said random number R_(m) ^((k)).
 4. The method of claim 2, wherein: said step (a) includes a step wherein said each participant device sends said aimed value information h(k(+)b_(m) ^((k))(+)R_(m) ^((k))) to said server device together with said random number R_(m) ^((k)); said step (b) includes a step wherein said server device stores said random number R_(m) ^((k)) in a nonpublic memory; and said step (c) includes the steps wherein: said server device requests said each participant device to send said random number R_(m) ^((k)) corresponding to said index k; said each participant device sends said requested random number R_(m) ^((k)) to said server device; and said server device receives said random number R_(m) ^((k)).
 5. The method of claim 1 wherein said sequences of indexes k and values selectable as said aimed values are both monotonous increasing values in the same direction, and in said step (c) said server device determines the maximum aimed value.
 6. The method of claim 1, wherein said sequences of indexes k and values selectable as said aimed values are both monotonous increasing values in opposite directions, and in said step (c) said server device determines the minimum aimed value.
 7. The method of claim 1, wherein let an arbitrary aimed value be represented by PR=F(k)+Q, where F(k) is a value in said conversion table corresponding to said index k and Q is a fraction which is a positive integer which satisfies F(k+1)−F(k)>Q≧0; said step (a) includes a step wherein, letting said aimed value PR_(m) of said each participant device m be represented by PR_(m)=F(k_(m))+Q_(m), said each participant device m generates said aimed value information by processing said initial value with said one-way function h by the number of times corresponding to k_(m), sends said aimed value information to said server device together with said fraction Q_(m), where m=1, 2, . . . , M, M being an integer equal to or greater than 2; said step (b) includes a step wherein said server device publishes said aimed value information and said fraction Q_(m) on a bulletin board accessible from all of said participant devices; said step (c) includes a step where said server device makes a check for matching between said updated initial value and said aimed value information for each index value in an ascending or descending order of said fraction Q_(m) where m=1, 2, . . . , M; and said step (d) includes a step wherein upon first detection of a match in said step (c), said server device finishes said check and determines, from k_(m) and m at the time of detecting the match, that PR_(m)=F(k_(m))+Q_(m) is said maximum or minimum aimed value.
 8. The method of claim 1, further comprising the steps wherein: (0-1) said each participant device m sends its identifier ID_(m) to a provisional identifier registration device; (0-2) said provisional identifier registration device issues a provisional identifier AID_(m) for said identifier ID_(m), and stores said identifier ID_(m) and said provisional identifier AID_(m) in pair form in storage means; (0-3) said provisional identifier registration device sends said provisional identifier AID_(m) to said each participant device; and (0-4) said each participant device m sends said provisional identifier AID_(m) as said identifier to said server device, together with said aimed value information.
 9. A participant device for a system in which M participant devices send their aimed values to a server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received, said participant device comprising: aimed value generating means; aimed value transforming means which processes said aimed value with a predetermined one-way function by the number of times corresponding to said aimed value to obtain aimed value information; and sending means for sending to said server device said aimed value information and an identifier specifying said participant device.
 10. The participant device of claim 9, wherein said aimed value transforming means comprises: a conversion table for converting said aimed value PR_(m) to the corresponding index k_(m); a one-way function h processor which processes an initial value IV_(m) inherent to said participant device with a one-way function h by the number of times corresponding to said index k_(m) to obtain an output h^(km)(IV_(m)); and a one-way function g processor which processes said output from said one-way function h processor with a one-way function g to obtain said aimed value information.
 11. The participant device of claim 10, further comprising verification information generating means which generates C_(m)=h^(K+1)(IV_(m)) as verification information by processing said initial value IV_(m) with said one-way function h K+1 times and sends said verification information C_(m) to said server device.
 12. The participant device of claim 9, wherein said aimed value information transforming means comprises: a memory in which there is stored a conversion table which defines the relationships between a sequence of monotone varying values selectable as aimed values and a sequence of indexes, for converting said aimed value PR_(m) to the corresponding index k_(m); a one-way function h processor which processes an initial value inherent to said participant device with a one-way function h by the number of time corresponding to said index k_(m) and outputs h^(km)(IV_(m)); and a one-way function g processor which processes the output from said one-way function h processor with a one-way function g to obtain said aimed value information.
 13. The participant device of claim 9, which further comprises: a random generator for generating a random number R_(m); an operating device for operating said random number R_(m) and said aimed value PR_(m) to obtain PR_(m)(+)R_(m); one-way function h processing means for processing said PR_(m)(+)R_(m) with a one-way function h to obtain h(PR_(m)(+)R_(m)); and verification information generating means for processing said initial value IV_(m) with said one-way function h K+1 times to generate C_(m)=h^(K+1)(IV_(m)); and wherein said h(PR_(m)(+)R_(m)) and said verification information are sent to said server device together with said aimed value information.
 14. The participant device of claim 9, wherein said aimed value transformer comprises: a conversion table memory which has stored therein a conversion table which defines indexes k=1, 2, . . . , K corresponding to K kinds of values selectable as aimed values; a select information generator which generates select information b_(m) ^((k)) indicating whether to select an aimed value corresponding to each of said indexes k=1, 2, . . . , K; a random generator which generates a random number R_(m) ^((k)) inherent to said participant device m and said index k; an operating device which receives said index k, said random number R_(m) ^((k)) and said select information b_(m) ^((k)) and performs an operation k(+)b_(m) ^((k))(+)R_(m) ^((k)); a one-way function h processor which processes said k(+)b_(m) ^((k))(+)R_(m) ^((k)) with a one-way function h to obtain h(k(+)b_(m) ^((k))(+)R_(m) ^((k))); and a control device which computes said h(k(+)b_(m) ^((k))(+)R_(m) ^((k))) for each of said indexes k and provides the k pieces information as said aimed value information.
 15. The participant device of claim 9, wherein said aimed value transformer comprises: a conversion table memory which has stored therein a conversion table which defines indexes k=1, 2, . . . , K corresponding to K kinds of values selectable as aimed values, for converting said aimed value PR_(m) to the corresponding index k_(m); initial value updating means which, for each index k, processes an initial value with a one-way function h and adds the processed initial value with select information b_(m) ^((k)) for said index k to obtain an updated initial value and repeats this processing until k=K is reached, thereby generating H_(m) ^((K)); select information generator which generates said select information b_(m) ^((k)) whether said aimed value corresponds to each index k from at least k_(m) to K; a one-way function h processor which processes said initial value with said one-way function h; a concatenator which concatenates said H_(m) ^((k−1)) and said select information to generate H_(m) ^(k)=h(H_(m) ^((k−1))∥b_(m) ^((k))); a buffer which temporarily holds the output from said concatenator and outputs said output for the next value of said index k; and a storage part which, for each value of said index k, stores H_(m) ^((k)) corresponding thereto; and wherein said sending means is a means which responds to a request of said server device for said index k to read out H_(m) ^((k)) from said storage part and send said H_(m) ^((k)) to said server device.
 16. The participant device of claim 9, wherein said aimed value transformer comprises: a conversion table memory which has stored therein a conversion table which defines indexes k=1, 2, . . . , K corresponding to K kinds of values selectable as aimed values, for converting said aimed value PR_(m) to the corresponding index k_(m); a one-way function g processor which processes said initial value IV_(m) with a one-way function g by a predetermined number of times x_(m) to generate g^(xm)(IV_(m)); a one-way function h processor which processes said g^(xm)(IV_(m)) with a one-way function h K−k_(m) times to generate H_(m) ^((K))=h^(k−km)(g^(xm)(IV_(m))) as said aimed value information; and response generating means which responds to a request from said server device for k to decide whether k=k_(m), and if true, generates H_(m) ^((k−1))=h^(k−km−1)(g^(xm)(IV_(m))), and if false, generates H_(m) ^((k−1))=g^(xm−1)(IV_(m)); and wherein said sending means sends said H_(m) ^((k−1)) in response to said request from said server device for said k.
 17. The participant device of claim 9, wherein said aimed value transformer comprises: a conversion table memory which has stored therein a conversion table which defines the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, for converting said aimed value PR_(m) to the corresponding index k_(m); a fraction calculating part which, letting an arbitrary aimed value PR be represented by PR=F(k)+Q, where F(k) is a value in said conversion table corresponding to said k and Q is a fraction which is a positive integer which satisfies F(k+1)−F(k)>Q≧0, calculates said fraction Q_(m)=PR_(m)−F(k_(m)) based on F(k_(m)) obtained from said conversion table and said aimed value PR_(m); and a one-way function h processor which processes said initial value IV_(m) with said one-way function h by the number of times corresponding to said k_(m) to generate said aimed value information; and wherein said sending means sends said fraction Q_(m) to said server device together with said aimed value information.
 18. The device of claim 10, wherein a sequence of index values k and a sequence of values selectable as said aimed values on said conversion table are monotone increasing values in the same direction, and said server device determines the maximum aimed value.
 19. The device of claim 10, wherein a sequence of index values k and a sequence of values selectable as said aimed values on said conversion table are monotone increasing values in opposite directions, and said server device determines the minimum aimed value. 